Boolean Hierarchy of Partitions over Reducible Bases
نویسنده
چکیده
The boolean hierarchy of partitions was introduced and studied by K. Wagner and S. Kosub, mostly over the lattice of NP -sets. We consider this hierarchy for the case of lattices having the reduction property and show that in this case the hierarchy behaves much easier and admits a deeper investigation. We completely characterize the hierarchy over some concrete important lattices, e.g. over the lattice of recursively enumerable
منابع مشابه
Classifying ω-Regular Partitions
We try to develop a theory of ω-regular partitions in parallel with the theory around the Wagner hierarchy of regular ω-languages. In particular, we generalize a theorem of L. Staiger and K. Wagner to the case of partitions, prove decidability of all levels of the Boolean hierarchy of regular partitions over open sets, establish coincidence of reducibilities by continuous functions and by funct...
متن کاملOn truth-table reducibility to SAT and the difference hierarchy over NP
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as log space truth-table reducibility via Boolean formulas to SAT and the same as log space Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. Finally, we show that the infinite difference hierarc...
متن کاملOn the Wadge reducibility of k-partitions
We establish some results on the Wadge degrees and on the Boolean hierarchy of k-partitions of some spaces, where k is a natural number. The main attention is paid to the Baire space, Baire domain and their close relatives. For the case of Δ2-measurable k-partitions the structures of Wadge degrees are characterized completely. For many degree structures, undecidability of the first-order theori...
متن کاملComplexity-Restricted Advice Functions
We consider uniform subclasses of the nonuniform complexity classes de ned by Karp and Lipton via the notion of advice functions These subclasses are obtained by restricting the complexity of computing correct advice We also investigate the e ect of allowing advice functions of limited complexity to depend on the input rather than on the input s length Among other results using the notions desc...
متن کاملFaces and Bases: Boolean Intervals
Abstract. We consider redundant analogues of the f and hvectors of simplicial complexes and present bases of R related to these “long” f and h-vectors describing the face systems Φ ⊆ 2 ; we list the corresponding change of basis matrices. The representations of the long f and h-vectors of a face system with respect to various bases are expressed based on partitions of the system into Boolean in...
متن کامل